Efficient Implementation for CIOQ Switches with Sequential Iterative Matching Algorithms

نویسندگان

  • Xiaojun Yang
  • Christoforos Kachris
  • Manolis Katevenis
چکیده

This paper presents the implementation of a crossbar-based CIOQ switch with a novel matching algorithm that can be used for efficient interprocessor communication. The proposed matching algorithm, called SIM, uses a sequential mode to replace the traditional parallel mode to improve the efficiency of iterative matching operation. Moreover, the paper presents a FIFO-based request scheduler for the implementation of SIM. The proposed algorithm and its implementation architecture are evaluated in an FPGA. The implementationbased simulation results show that for switches without speedup, SIM can achieve higher aggregate throughput and lower average delay than iSLIP. Moreover, SIM achieves a fair trade-off among performance and logic area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EE384Y Project Intermediate Report Enabling Class of Service for CIOQ Switches with Maximal Matching Algorithms

Providing Qualities of Service (QoS) is a desirable feature for most network routers and switches. The capability to service differential classes is a prerequisite to enable QoS. It has been shown that Output Queued (OQ) switches implementing Weighted Fair Queuing (WFQ) can provide QoS. However, OQ switches have high speed requirements for the fabric switch and the memory bandwidth, which makes...

متن کامل

Local Scheduling Policies in Networks of Packet Switches with Input Queues

A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queued (CIOQ) packet switches. As a result, a number of switch control algorithms have been proposed. Among these, scheduling policies based on Maximum Weight Matching (MWM) were identified as optimal, in the sense that they wer...

متن کامل

Efficient Scheduling for SDMG CIOQ Switches

Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate...

متن کامل

Packet-based scheduling algorithm for CIOQ switches with multiple traffic classes

A packet-based least cushion first/most urgent first (PB-LCF/MUF) maximal matching algorithm is presented in this paper for combined input and output queued (CIOQ) switches with multiple traffic classes. The main benefit of using a CIOQ switch is to alleviate memory bandwidth requirement while providing quality of service (QoS) guarantee. It was proved that, with a speedup factor of 2, a CIOQ s...

متن کامل

An Efficient Scheduling Algorithm for CIOQ Switches with Space-Division Multiplexing Expansion

Recently, CIOQ switches have attracted interest from both academic and industrial communities due to their ability of achieving 100% throughput and perfectly emulating OQ switch performance with a small speedup factor S. To achieve a speedup factor S, a conventional CIOQ switch requires the switch matrix and the memory to operate S times faster than the line rate. In this paper, we propose to u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010